Generalized a¢ ne maps and generalized convex functions
نویسندگان
چکیده
We study some classes of generalized convex functions, using a generalized derivative approach. We establish some links between these classes and we devise some optimality conditions for constrained optimization problems. In particular, we get Lagrange-Kuhn-Tucker multipliers for mathematical programming problems. Key words: colinvex, colin ne, generalized derivative, mathematical programming, optimality conditions, pseudoconvex function, pseudolinear function, quasiconvex function. Mathematics Subject Classi cation: 26B25, 46G05, 49K27, 90C26, 90C32
منابع مشابه
On generalized Hermite-Hadamard inequality for generalized convex function
In this paper, a new inequality for generalized convex functions which is related to the left side of generalized Hermite-Hadamard type inequality is obtained. Some applications for some generalized special means are also given.
متن کاملA generalized form of the Hermite-Hadamard-Fejer type inequalities involving fractional integral for co-ordinated convex functions
Recently, a general class of the Hermit--Hadamard-Fejer inequality on convex functions is studied in [H. Budak, March 2019, 74:29, textit{Results in Mathematics}]. In this paper, we establish a generalization of Hermit--Hadamard--Fejer inequality for fractional integral based on co-ordinated convex functions.Our results generalize and improve several inequalities obtained in earlier studies.
متن کاملConvex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions
We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...
متن کاملSIZE AND GEOMETRY OPTIMIZATION OF TRUSS STRUCTURES USING THE COMBINATION OF DNA COMPUTING ALGORITHM AND GENERALIZED CONVEX APPROXIMATION METHOD
In recent years, the optimization of truss structures has been considered due to their several applications and their simple structure and rapid analysis. DNA computing algorithm is a non-gradient-based method derived from numerical modeling of DNA-based computing performance by new computers with DNA memory known as molecular computers. DNA computing algorithm works based on collective intelli...
متن کاملSome results on convergence and existence of best proximity points
In this paper, we introduce generalized cyclic φ-contraction maps in metric spaces and give some results of best proximity points of such mappings in the setting of a uniformly convex Banach space. Moreover, we obtain convergence and existence results of proximity points of the mappings on reflexive Banach spaces
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009